Injectives in Finitely Generated Universal Horn Classes

نویسندگان

  • Michael H. Albert
  • Ross Willard
چکیده

Let K be a finite set of finite structures. We give a syntactic characterization of the property: every element of K is invective in ISP(K). We use this result to establish that 4 is invective in ISP(s) for every two-element algebra i. ?0. Introduction. Let K be a finite set of finite structures for a first-order language. In this paper we give a syntactic characterization (Theorem 4) of the property that each member of K is infective in ISP(K), the universal Horn class generated by K. We then show that K = {J} has this property for every two-element algebra J. This paper was motivated by the following question: for which two-element algebras J does ISP(.4) have the amalgamation property? The property stated above is stronger than the amalgamation property, so the answer is: for every twoelement algebra. Model companions appear in Lemma 1. For their definition and elementary properties see [8], but note that we replace a theory by its class of models. Theorem 9 rests on E. Post's classification [9] of all two-valued clones of operations, a summary of which appears in [7]. The results of ?1 are joint work of the authors, the individual contributions being inextricably combined but of equal magnitude. ?2 is due to R. Willard, and the details of ?3 were also worked out by R. Willard based on an explanation of the results in [1] given by M. H. Albert. ?1. The syntactic characterization. Let M be a class of structures for some firstorder language. The classes I(M), S(M), P(M) and Pfin(M) are the closures of M under isomorphism, substructures, products, and finite products respectively. Mfin is the class of all finite members of M. Arrows and hooked arrows between members of M denote homomorphisms and embeddings respectively. A member 9 of M is invective in M if every diagram 1 (a) in M can be completed to a commuting diagram 1(b). Received April 28, 1986; revised October 17, 1986. ' Research supported by an NSERC postdoctoral fellowship. 2Research supported by an Ontario graduate scholarship. ? 1987, Association for Symbolic Logic 0022-4812/87/5203-001 5/$0 1.70

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dualities for Equational Classes of Brouwerian Algebras and Heyting Algebras

This paper focuses on the equational class S„ of Brouwerian algebras and the equational class L„ of Heyting algebras generated by an »-element chain. Firstly, duality theories are developed for these classes. Next, the projectives in the dual categories are determined, and then, by applying the dualities, the injectives and absolute subretracts in Sn and L„ are characterized. Finally, free prod...

متن کامل

Axiomatisability and hardness for universal Horn classes of hypergraphs

We characterise finite axiomatisability and intractability of deciding membership for universal Horn classes generated by finite loop-free hypergraphs. A universal Horn class is a class of model-theoretic structures of the same signature, closed under taking ultraproducts (Pu), direct products over nonempty families (P) and isomorphic copies of substructures (S); see [9, 17, 30, 32] for example...

متن کامل

On Finitely Presented Expansions of Computably Enumerable Semigroups

Every computable universal algebra has a finitely presented expansion, but there are examples of finitely generated, computably enumerable universal algebras with no finitely presented expansions. It is natural to ask whether such examples can be found in well-known classes of algebras such as groups and semigroups. In this paper, we build an example of a finitely generated, infinite, computabl...

متن کامل

Topological Full Groups of Minimal Subshifts and Just-infinite Groups

In [24], confirming a conjecture of Hjorth-Kechris [16], Thomas-Velickovic proved that the isomorphism relation on the space Gfg of finitely generated groups is a universal countable Borel equivalence relation. (Here Gfg denotes the Polish space of finitely generated groups introduced by Grigorchuk [12]; i.e. the elements of Gfg are the isomorphism types of marked groups (G, c ), where G is a f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 52  شماره 

صفحات  -

تاریخ انتشار 1987